Degree multisets of hypergraphs
نویسندگان
چکیده
منابع مشابه
Co-degree density of hypergraphs
For an r-graph H, let C(H) = minS d(S), where the minimum is taken over all (r− 1)-sets of vertices of H, and d(S) is the number of vertices v such that S ∪ {v} is an edge of H. Given a family F of r-graphs, the co-degree Turán number co-ex(n,F) is the maximum of C(H) among all r-graphs H which contain no member of F as a subhypergraph. Define the co-degree density of a family F to be γ(F) = li...
متن کاملOn Even-Degree Subgraphs of Linear Hypergraphs
A subgraph of a hypergraph H is even if all its degrees are positive even integers, and b-bounded if it has maximum degree at most b. Let fb(n) denote the maximum number of edges in a linear nvertex 3-uniform hypergraph which does not contain a b-bounded even subgraph. In this paper, we show that if b ≥ 12, then n logn 3b log logn ≤ fb(n) ≤ Bn(logn) for some absolute constant B, thus establishi...
متن کاملMatchings in hypergraphs of large minimum degree
It is well known that every bipartite graph with vertex classes of size n whose minimum degree is at least n/2 contains a perfect matching. We prove an analogue of this result for hypergraphs. We also prove several related results which guarantee the existence of almost perfect matchings in r-uniform hypergraphs of large minimum degree. Our bounds on the minimum degree are essentially best poss...
متن کاملDegree Sequences in Complexes and Hypergraphs
Given an rc-complex K and a vertex v in K, the ndegree of v is the number of n-simplexes in K containing t7. The set of all Ti-degrees in a complex K is called its n-degree sequence when arranged in nonincreasing order. The question "Which sequences of integers are ndegree sequences?" is answered in this paper. This is done by generalizing the iterative characterization for the 1-dimensional (g...
متن کاملIndependent Sets in Bounded-Degree Hypergraphs
In this paper we analyze several approaches to the Maximum Independent Set (MIS) problem in hypergraphs with degree bounded by a parameter ∆. Since independent sets in hypergraphs can be strong and weak, we denote by MIS (MSIS) the problem of finding a maximum weak (strong) independent set in hypergraphs, respectively. We propose a general technique that reduces the worst case analysis of certa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bulletin of the Australian Mathematical Society
سال: 1982
ISSN: 0004-9727,1755-1633
DOI: 10.1017/s0004972700005955